Multidimensional Scaling by Majorization: A Review
نویسندگان
چکیده
منابع مشابه
Multidimensional Scaling Using Majorization: SMACOF in R
In this paper we present the methodology of multidimensional scaling problems (MDS) solved by means of the majorization algorithm. The objective function to be minimized is known as stress and functions which majorize stress are elaborated. This strategy to solve MDS problems is called SMACOF and it is implemented in an R package of the same name which is presented in this article. We extend th...
متن کاملMultidimensional Scaling by Deterministic Annealing
Multidimensional scaling addresses the problem how proximity data can be faithfully visualized as points in a low-dimensional Euclidian space. The quality of a data embedding is measured by a cost function called stress which compares proximity values with Euclidian distances of the respective points. We present a novel deterministic an-nealing algorithm to eeciently determine embedding coordin...
متن کاملA Metric Multidimensional Scaling
| Multidimensional Scaling (MDS) techniques always pose the problem of analysing a large number N of points, without collecting all N(N?1) 2 possible interstimuli dissimilarities, and while keeping satisfactory solutions. In the case of metric MDS, it was found that a theoretical minimum of appropriate 2N ?3 exact Euclidean distances are suf-cient for the unique representation of N points in a ...
متن کاملJob satisfaction as a multidimensional concept: A systematic review study
Background : Some researchers have argued that job satisfaction has been vaguely defined in the organizational literature. Also, there is a lack of consensus over the meaning of job satisfaction in literature. The aim of this study was to clarify dimensions of job satisfaction's concept based on a systematic review study. Materials and Methods: The present study used a systemat...
متن کاملMultidimensional Scaling Methods for Many-Object Sets: A Review.
Given a set of dissimilarities data between n objects, multidimensional scaling is the problem of reconstructing a geometrical pattern of these objects, using n points, so that between-points distance corresponds to between-objects dissimilarity. Often, the collection of input data requires rating the dissimilarities between all n(n - 1)/2 possible pairs of stimuli. When the number of stimuli i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Software
سال: 2016
ISSN: 1548-7660
DOI: 10.18637/jss.v073.i08